Learning Computational Grammars
نویسندگان
چکیده
This paper reports on the LEARNING COMPUTATIONAL GRAMMARS (LCG) project, a postdoc network devoted to studying the application of machine learning techniques to grammars suitable for computational use. We were interested in a more systematic survey to understand the relevance of many factors to the success of learning, esp. the availability of annotated data, the kind of dependencies in the data, and the availability of knowledge bases (grammars). We focused on syntax, esp. noun phrase (NP) syntax.
منابع مشابه
Computational Learning of Probabilistic Grammars in the Unsupervised Setting
With the rising amount of available multilingual text data, computational linguistics faces an opportunity and a challenge. This text can enrich the domains of NLP applications and improve their performance. Traditional supervised learning for this kind of data would require annotation of part of this text for induction of natural language structure. For these large amounts of rich text, such a...
متن کاملStochastic Optimality Theory, local search, and Bayesian learning of hierarchical models
The Gradual Learning Algorithm (GLA) (Boersma and Hayes, 2001) can be seen as a stochastic local search method for learning Stochastic OT grammars. This paper tries to achieve the following goals: first, in response to the criticism in (Keller and Asudeh, 2002), we point out that the computational problem of learning stochastic grammars does have a general approximate solution (Lin, 2005). Seco...
متن کاملMachine Learning Comprehension Grammars for Ten Languages
Comprehension grammars for a sample of ten languages (English, Dutch, German, French, Spanish, Catalan, Russian, Chinese, Korean, and Japanese) were derived by machine learning from corpora of about 400 sentences. Key concepts in our learning theory are: probabilistic association of words and meanings, grammatical and semantical form generalization, grammar computations, congruence of meaning, ...
متن کاملBasic Gene Grammars and DNA-ChartParser for language processing of Escherichia coli promoter DNA sequences
MOTIVATION The field of 'DNA linguistics' has emerged from pioneering work in computational linguistics and molecular biology. Most formal grammars in this field are expressed using Definite Clause Grammars but these have computational limitations which must be overcome. The present study provides a new DNA parsing system, comprising a logic grammar formalism called Basic Gene Grammars and a bi...
متن کاملImplicit Learning of Recursive Context-Free Grammars
Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.CL/0107017 شماره
صفحات -
تاریخ انتشار 2001